Higher-Order Order-Sorted Resolution
نویسنده
چکیده
The introduction of sorts to rst-order automated deduction has brought greater conciseness of representation and a considerable gain in eeciency by reducing the search space. It is therefore promising to treat sorts in higher order theorem proving as well. In this paper we present a generalization of Huet's Constrained Resolution to an order-sorted type theory T with term declarations. This system builds certain taxonomic axioms into the uniication and conducts reasoning with them in a controlled way. We make this notion precise by giving a relativization operator that totally and faithfully encodes T into simple type theory. Intelligenz" of the Deutsche Forschungsgemeinschaft (DFG) and the \Studienstiftung des deutschen Volkes".
منابع مشابه
A mechanization of sorted higher-order logic based on the resolution principle
The usage of sorts in first-order automated deduction has brought greater conciseness of representation and a considerable gain in efficiency by reducing the search spaces involved. This suggests that sort information can be employed in higher-order theorem proving with similar results. This thesis develops a sorted higher-order logic ΣHOL suitable for automatic theorem proving applications. ΣH...
متن کاملDistributed reasoning with ontologies and rules in order-sorted logic programming
Integrating ontologies and rules on the Semantic Web enables software agents to interoperate between them; however, this leads to two problems. First, reasoning services in SWRL (a combination of OWL and RuleML) are not decidable. Second, no studies have focused on distributed reasoning services for integrating ontologies and rules in multiple knowledge bases. In order to address these problems...
متن کاملA Combinator-based Order-sorted Higher-order Uniication Algorithm
This paper develops a sound and complete transformation-based algorithm for uniication in an extensional order-sorted combinatory logic supporting constant overloading and a higher-order sort concept. Appropriate notions of order-sorted weak equality and extensionality | reeecting order-sorted-equality in the corresponding lambda calculus given by Johann and Kohlhase | are deened, and the typed...
متن کاملSOUND AND COMPLETE TRANSLATIONSFROM SORTED HIGHER - ORDER LOGICINTO SORTED FIRST - ORDER LOGICManfred
Extending existing calculi by sorts is a strong means for improving the deductive power of rst-order theorem provers. Since many mathematical facts can be more easily expressed in higher-order logic { aside the greater power of higher-order logic in principle {, it is desirable to transfer the advantages of sorts in the rst-order case to the higher-order case. One possible method for automating...
متن کاملThe completeness of logic programming with sort predicates
An order-sorted logic can be regarded as a generalized first-order predicate logic that includes many and ordered sorts (i.e. a sort-hierarchy). In the fields of knowledge representation and AI, this logic with sort-hierarchy has been used to design a logic-based language appropriate for representing taxonomic knowledge. By incorporating the sort-hierarchy, order-sorted resolution and sorted lo...
متن کامل